3iCubing: An Interval Inverted Index Approach to Data Cubes

The increase in the amounts of information used to analyze data is problematic since memory necessary store and process it getting quite big. interval inverted index representation was developed reduce required data, Frag-Cubing one most popular algorithms. In this paper, we propose two new cubing algorithms: 3iCubing M3iCubing. a Frag-Cubing-based algorithm that uses representation, while M3iCubing both normal representation. algorithms were compared using synthetic real sets indexation querying operations, runtime memory-wise. experimental evaluation shows can considerably needed set, reducing around 25% by Frag-Cubing. Moreover, results show dependent on skewness consumption, having positive with highly skewed real-world sets.